Description: 一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供-VHDL with a Fast Fourier Transform papers, including the principle of analysis and implementation of the code, the Mahatma Gandhi Institute of the University of Marat Platform: |
Size: 63132 |
Author:咱航 |
Hits:
Description: 实现快速傅立叶变换的程序，是matlab下的M文件，内部还和含有一个介绍PDF文件-fast Fourier transform procedures, the Matlab M paper Internal also contains an introduction and PDF files Platform: |
Size: 147360 |
Author:何伟兵 |
Hits:
Description: 一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供-VHDL with a Fast Fourier Transform papers, including the principle of analysis and implementation of the code, the Mahatma Gandhi Institute of the University of Marat Platform: |
Size: 62464 |
Author: |
Hits:
Description: 实现快速傅立叶变换的程序，是matlab下的M文件，内部还和含有一个介绍PDF文件-fast Fourier transform procedures, the Matlab M paper Internal also contains an introduction and PDF files Platform: |
Size: 147456 |
Author:何伟兵 |
Hits:
Description: FFT参考设计和一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供
-FFT reference design using VHDL and realize a fast Fourier transform of the thesis, including the principles of analysis and code realize, India Mahatma Gandhi University College, MA Platform: |
Size: 93184 |
Author:吴庆庆 |
Hits:
Description: fft并行算法实现，C语言开发，用mpi编程完成-fft parallel algorithm, C language development, with the completion of mpi programming Platform: |
Size: 2048 |
Author:kmart |
Hits:
Description: 一篇用VHDL实现快速傅立叶变换的论文，包括原理分析和代码实现，印度圣雄甘地大学M.A.学院提供，同时包含使用手册，做FFT很好的-VHDL with a fast Fourier transform papers, including the principle of analysis and code, India Mahatma Gandhi Institute of the University of MA, at the same time contains the user manual, so good FFT Platform: |
Size: 391168 |
Author:费尔德 |
Hits:
Description: FFT，即为快速傅氏变换，是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。它对傅氏变换的理论并没有新的发现，但是对于在计算机系统或者说数字系统中应用离散傅立叶变换，可以说是进了一大步。 设x(n)为N项的复数序列，由DFT变换，任一X（m）的计算都需要N次复数乘法和N-1次复数加法，而一次复数乘法等于四次实数乘法和两次实数加法， -FFT, fast Fourier transform which is a discrete fast Fourier transform algorithm, which is the discrete Fourier transform of the odd and even, true, false, such as characteristics of the Discrete Fourier Transform algorithm obtained. Fourier transform theory it is not a new discovery, but in the computer system or the application of digital systems Discrete Fourier Transform, can be said to be a big step. Set x (n) for N sequences of the plural, by the DFT transform, either X (m) requires the calculation of complex multiplication and N times N-1 times the plural adder, and a complex multiplication is equivalent to four times the number of multiplication and two real addition, Platform: |
Size: 1024 |
Author:常虎 |
Hits:
Description: This program is open source code of fast Fourier transform in matlab.
Where y is the input argument and p is the normalized size of the input. Let
y = [1 2 3 4 ]
x= length(y)
m= log2(x)
p= ceil(m)
To call the function use
ft2(y,p) -This program is open source code of fast Fourier transform in matlab.
Where y is the input argument and p is the normalized size of the input. Let
y = [1 2 3 4 ]
x= length(y)
m= log2(x)
p= ceil(m)
To call the function use
ft2(y,p) Platform: |
Size: 1024 |
Author:ry |
Hits:
Description: 用matlab编写的fft快速傅立叶变换及逆变换函数,文件用M语言写成，可以运行-Matlab prepared using fft Fast Fourier Transform and inverse transform function, M language documents, you can run Platform: |
Size: 2048 |
Author:冉涛 |
Hits:
Description: This package contains script to calculate aliasing for given time domain signal. Script to plot in time domain the function: x(t)=A0cos(2pif0t)+A1cos(2pif1t)
where fs1=300 Hz and fs2=150 Hz (sampling rate)
A0 and A1 are amplitude s signal (armónicos).
f0 is the maximun component in frecuency of the signal to sample,
when it shows X(t) signal with a sampling frecuency 300 Hz,
we will see Aliasing :)
It s because we aren t meetting with the Nyquist Theorem, because we don t choice Fs>=2FNy Fs(Sampling Frec) FNy(Frec Nyquist) to sample aplying fft(fast fourier transform) with at least 600 Hz.
By actinio --vjgonzalezg@gmail.com-This package contains script to calculate aliasing for given time domain signal. Script to plot in time domain the function: x(t)=A0cos(2pif0t)+A1cos(2pif1t)
where fs1=300 Hz and fs2=150 Hz (sampling rate)
A0 and A1 are amplitude s signal (armónicos).
f0 is the maximun component in frecuency of the signal to sample,
when it shows X(t) signal with a sampling frecuency 300 Hz,
we will see Aliasing :)
It s because we aren t meetting with the Nyquist Theorem, because we don t choice Fs>=2FNy Fs(Sampling Frec) FNy(Frec Nyquist) to sample aplying fft(fast fourier transform) with at least 600 Hz.
By actinio --vjgonzalezg@gmail.com-- Platform: |
Size: 1024 |
Author:actinio |
Hits:
Description: 利用matlab的fft函数进行快速傅里叶变换的m文件-Matlab' s fft function using the fast Fourier transform of the m file Platform: |
Size: 1024 |
Author:张扬 |
Hits:
Description: this m file is fast Fourier transform (FFT).and is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse of recorded signal-this m file is fast Fourier transform (FFT).and is an efficient algorithm to compute the discrete Fourier transform (DFT) and its inverse of recorded signal Platform: |
Size: 51200 |
Author:darush1920 |
Hits:
Description: 数字信号处理实验，快速傅立叶变换，内含有matlab实验m文件以及实验报告，供大家参考。-Digital signal processing experiment, fast Fourier transform, contains matlab experiment m documents and the experiment report for your reference. Platform: |
Size: 30720 |
Author: |
Hits:
Description: 自己写的快速傅里叶变换，处理N点数据的傅里叶变换，含两个MATLAB的M文件,可直接使用-Fast Fourier Transform, write your own data of the N-point Fourier transform, containing two MATLAB M-files can be used directly Platform: |
Size: 1024 |
Author:ChengLi |
Hits:
Description: This program is open source code of fast Fourier transform in matlab. Where y is the input argument and p is the normalized size of the input. Let y = [1 2 3 4 ] x= length(y) m= log2(x) p= ceil(m) To call the function use ft2(y,p) -This program is open source code of fast Fourier transform in matlab. Where y is the input argument and p is the normalized size of the input. Let y = [1 2 3 4 ] x= length(y) m= log2(x) p= ceil(m) To call the function use ft2(y,p) Platform: |
Size: 1024 |
Author:swithPr |
Hits:
Description: FFT，即为快速傅氏变换，是离散傅氏变换的快速算法，它是根据离散傅氏变换的奇、偶、虚、实等特性，对离散傅立叶变换的算法进行改进获得的。它对傅氏变换的理论并没有新的发现，但是对于在计算机系统或者说数字系统中应用离散傅立叶变换，可以说是进了一大步。(FFT, that is fast Fourier transform, is a fast algorithm for discrete Fourier transform. It is based on the odd, even, imaginary, real and other characteristics of discrete Fourier transform, and the algorithm of discrete Fu Liye transform is improved. It does not make new discoveries about the theory of Fourier transform, but it can be a big step for the application of discrete Fu Liye transform in computer system or digital system.
Let x (n) is a complex sequence of N, by DFT transform, either X (m) calculations are N times N-1 times complex multiplication and addition, and a complex multiplication is equivalent to four times the number of multiplication and two real addition, a complex addition is equivalent to two times the number of addition,) Platform: |
Size: 215040 |
Author:GuoW
|
Hits:
Search - fast fourier transform M